Quantum margulis expanders
نویسندگان
چکیده
Received (received date) Revised (revised date) We present a simple way to quantize the well-known Margulis expander map. The result is a quantum expander which acts on discrete Wigner functions in the same way the classical Margulis expander acts on probability distributions. The quantum version shares all essential properties of the classical counterpart, e.g., it has the same degree and spectrum. Unlike previous constructions of quantum expanders, our method does not rely on non-Abelian harmonic analysis. Analogues for continuous variable systems are mentioned. Indeed, the construction seems one of the few instances where applications based on discrete and continuous phase space methods can be developed in complete analogy. Motivated by the prominent role expander graphs play in theoretical computer science [1], quantum expanders have recently received a great deal of attention [2, 3, 4, 5, 6, 7]. In this work, we report an observation which allows for the simple explicit construction of such quantum expanders. The method relies heavily on quantum phase space techniques: Once familiar with this techniques, the result is an almost trivial corollary of the analogous classical statement. We further discuss continuous analogues of quantum expanders, where again, phase space methods render this an obvious generalization. Hence, the present work can equally be regarded as the presentation of a simple quantum expander, as as a short exposition of the strengths of the phase space formalism as such. 1.1 Expanders Expander graphs turn up in various areas of combinatorics and computer science (for all claims made in this section, the reader is referred to the excellent survey article Ref. [1]). They often come into play when one is concerned with a property which " typically " holds, but defies systematic understanding. A simple example is given by classical error correction codes. One can show that a randomly chosen code is extremely likely to have favorable properties, but it seems very difficult to come up with a deterministic construction of codes
منابع مشابه
CS 369 E : Expanders in Computer Science
for their meticulous note-taking. We also thank Microsoft Research and the Computer Science Department at Stanford. We had indeed advertised that we will be covering recent results in the course announcement. We had planned to cover Reingold's new result " SL=L " , which we presented in lecture as scheduled. Little did we expect that Irit Dinur would come up with a simple proof of the PCP Theor...
متن کاملAn Explicit Construction of Quantum Expanders
Quantum expanders are a natural generalization of classical expanders. These objects were introduced and studied by [1, 3, 4]. In this note we show how to construct explicit, constant-degree quantum expanders. The construction is essentially the classical Zig-Zag expander construction of [5], applied to quantum expanders.
متن کاملQuantum expanders and the quantum entropy difference problem
Classical expanders and extractors have numerous applications in computer science. However, it seems these classical objects have no meaningful quantum generalization. This is because it is easy to generate entropy in quantum computation simply by tracing out registers. In this paper we define quantum expanders and extractors in a natural way. We show that this definition is exactly what is nee...
متن کاملSymmetric Groups and Expanders
We construct an explicit generating sets Fn and F̃n of the alternating and the symmetric groups, which make the Cayley graphs C(Alt(n), Fn) and C(Sym(n), F̃n) a family of bounded degree expanders for all sufficiently large n. These expanders have many applications in the theory of random walks on groups and other areas of mathematics. A finite graph Γ is called an ǫ-expander for some ǫ ∈ (0, 1), ...
متن کاملOn the expansion rate of Margulis expanders
In this note we determine exactly the expansion rate of an infinite 4-regular expander graph which is a variant of an expander due to Margulis. The vertex set of this graph consists of all points in the plane. The point (x, y) is adjacent to the points S(x, y), S(x, y), T (x, y), T(x, y) where S(x, y) = (x, x+y) and T (x, y) = (x+y, y). We show that the expansion rate of this 4-regular graph is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information & Computation
دوره 8 شماره
صفحات -
تاریخ انتشار 2008